Skolem Functions and Elementary Extensions
نویسندگان
چکیده
In [4] Payne constructed such a pair of uncountable models for an uncountable language. Knight [1] announced that the language could be countable and presented her construction in [3] together with other examples one of which is a " nonSkolemizable elementary triple " of countable structures for a countable language. Payne's, Knight's and the present construction all seem to use rather different ideas.
منابع مشابه
Conservative extensions of models of arithmetic
We give two characterizations of conservative extensions of models of arithmetic, in terms of the existence and uniqueness of certain amalg~mations with other models. We also establish a connection between conservativity and some combinatorial properties of ultrafilter mappings. Arithmetic is, in this paper, the complete theory of the structure N whose universe is the set of natural numbers and...
متن کاملModel-Theoretic Constructions in Fuzzy Logic with Evaluated Syntax
This paper studies the model theory as generalization of classical model theory in predicate fuzzy logic with evaluated syntax (Ev L ). There exist a lot of possibilities how to find the models of fuzzy theories. In this paper we will describe the theoretic constructions of the models in Ev L where these models are built by using elementary extensions and downward Löwenheim-Skolem-Tarski theore...
متن کاملOn the Number of Elementary Submodels of an Unsuperstable Homogeneous Structure
We show that if M is a stable unsuperstable homogeneous structure, then for most κ < |M| , the number of elementary submodels of M of power κ is 2 . Through out this paper we assume that M is a stable unsuperstable homogeneous model such that |M| is strongly inaccessible (= regular and strong limit). We can drop this last assumption if instead of all elementary submodels of M we study only suit...
متن کاملFinite Bases with Respect to the Superposition in Classes of Elementary Recursive Functions, dissertation
This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by a composition of $x+1$, $xy$, $\max(x-y,0)$, $x\wedge y$, $\lfloor x/y \rfloor$, and one exponential function ($2^x$ or $x^y$) using formulas that have no m...
متن کاملSkolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006